Information-Theoretic Limits for the Matrix Tensor Product
نویسندگان
چکیده
منابع مشابه
Information - Theoretic Limits for Density Estimation
This paper is concerned with the information-theoretical limits of density estimation for Gaussian random variables with data drawn independently and with identical distributions. We apply Fano’s inequality to the space of densities and an arbitrary estimator. We derive necessary conditions on the sample size for reliable density recovery and for reliable density estimation. These conditions ar...
متن کاملImproved tensor-product expansions for the two-particle density matrix
Gábor Csányi,* Stefan Goedecker, and T. A. Arias Department of Physics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139 Département de Recherche Fondamentale sur la Matière Condensée, SP2M/NM, CEA-Grenoble, 38054 Grenoble cedex 9, France Laboratory of Atomic and Solid State Physics, Cornell University, Ithaca, New York 14853 ~Received 20 July 2001; published 20 February 2002!
متن کاملInformation-theoretic Limits for Community Detection in Network Models
We analyze the information-theoretic limits for the recovery of node labels in several network models, including the stochastic block model, as well as the latent space model. For the stochastic block model, the non-recoverability condition depends on the probabilities of having edges inside a community, and between different communities. For the latent space model, the non-recoverability condi...
متن کاملThe information and wave-theoretic limits of analog beamforming
The performance of broadband millimeter-wave (mmWave) RF architectures, is generally determined by mathematical concepts such as the Shannon capacity. These systems have also to obey physical laws such as the conservation of energy and the propagation laws. Taking the physical and hardware limitations into account is crucial for characterizing the actual performance of mmWave systems under cert...
متن کاملOn the Information Theoretic Limits of Learning Ising Models
We provide a general framework for computing lower-bounds on the sample complexity of recovering the underlying graphs of Ising models, given i.i.d. samples. While there have been recent results for specific graph classes, these involve fairly extensive technical arguments that are specialized to each specific graph class. In contrast, we isolate two key graph-structural ingredients that can th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal on Selected Areas in Information Theory
سال: 2020
ISSN: 2641-8770
DOI: 10.1109/jsait.2020.3040598